On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
نویسندگان
چکیده
منابع مشابه
On Jacobi and Jacobi - I ike Algorithms for a Parallel Computer
Many existing algorithms for obtaining the eigenvalues and eigenvectors of matrices would make poor use of such a powerful parallel computer as the ILLIAC IV. In this paper, Jacobi's algorithm for real symmetric or complex Hermitian matrices, and a Jacobi-like algorithm for real nonsymmetric matrices developed by P. J. Eberlein, are modified so as to achieve maximum efficiency for the parallel ...
متن کاملTitchmarsh theorem for Jacobi Dini-Lipshitz functions
Our aim in this paper is to prove an analog of Younis's Theorem on the image under the Jacobi transform of a class functions satisfying a generalized Dini-Lipschitz condition in the space $mathrm{L}_{(alpha,beta)}^{p}(mathbb{R}^{+})$, $(1< pleq 2)$. It is a version of Titchmarsh's theorem on the description of the image under the Fourier transform of a class of functions satisfying the Dini-Lip...
متن کاملThree-Level Parallel J-Jacobi Algorithms for Hermitian Matrices
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal load balancing between all available processors/cores is obtained. A similar blocking technique can be used to exploit local cache memory of each processor to f...
متن کاملAn Efficient Jacobi-like Algorithm for Parallel Eigenvalue Computation
A very fast Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of the Jacobi rotation with a CORDIC processor, but by applying approximate rotations and adjusting them to single steps of the CORDIC i Igorithm, Le., only one angle of the CORDIC angle sequence defines the Jacobi rotation in each step...
متن کاملOn Jacobi{like Algorithms for Computing the Ordinary Singular Value Decomposition on Jacobi{like Algorithms for Computing the Ordinary Singular Value Decomposition
The increasing interest for using the OSVD in the real{time DSP domain necessitates an eecient computation of the OSVD. Special interest has been given to Jacobi{like algorithms which also is the case in this paper. After a description of the basic orthogonal transformations, algorithms for computing the OSVD are classiied and shortly described. Various rotation schemes for Jacobi{like algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1971
ISSN: 0025-5718
DOI: 10.2307/2005221